Learning target class eigen subspace (LTC-ES) via eigen knowledge grid

نویسندگان

چکیده

In one-class classification (OCC) tasks, only the target class (class-of-interest (CoI)) samples are well defined during training, whereas other totally absent. OCC algorithms, high dimensional data adds computational overhead apart from its intrinsic property of curse dimensionality. For learning, conventional dimensionality reduction (DR) techniques not suitable due to negligence unique statistical properties CoI samples. this context, present research proposes a novel guided DR technique extract eigen knowledge grid that contains most promising eigenvectors variance-covariance matrix process lower and higher eigenvalued rejected via analysis because variance may split itself, do contribute significant information. Furthermore, identified is utilized transform subspace. The proposed approach named as learning subspace (LTS-ES) ensures strong separation classes. To show effectiveness transformed subspace, one support vector machine (OCSVM) has been experimented on wide variety benchmark datasets in presence of: original feature space, features obtained approximately 80%-90% cumulative variance, 50% variance. Finally, new performance measure parameter called stability factor introduced validate robustness approach.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchical Eigen Template Matching for Target Detection

The template matching is the basic technique of the object detection such as the defect inspection and OCR (Optical Character Recognition). It has a problem which requires a lot of computational time for detecting the XY displacement and the rotational angle of the target object. We have proposed the eigen template method for this problem. The proposed method can efficiently calculate correlati...

متن کامل

A modular eigen subspace scheme for high-dimensional data classification

In this paper, a novel filter-based greedy modular subspace (GMS) technique is proposed to improve the accuracy of high-dimensional data classification. The proposed approach initially divides the whole set of high-dimensional features into several arbitrary number of highly correlated subgroups by performing a greedy correlation matrix reordering transformation for each class. These GMS can be...

متن کامل

Eigen-solving via reduction to DPR1 matrices

Highly effective polynomial root-finders have been recently designed based on eigen-solving for DPR1 (that is diagonal + rankone) matrices. We extend these algorithms to eigen-solving for the general matrix by reducing the problem to the case of the DPR1 input via intermediate transition to a TPR1 (that is triangular + rank-one) matrix. Our transforms use substantially fewer arithmetic operatio...

متن کامل

Model order reduction via eigen decomposition analysis

In this paper, we have proposed a novel model order reduction technique via rational transfer function fitting and eigenmode analysis considering residues. We define a constant as a key in the sorting algorithm as one of correlations in order to sort the order of eigenvalues. It is demonstrated that the accuracy via eigenmode analysis considering residues is improved. The proposed algorithm is ...

متن کامل

Relevant Eigen - Subspace of a Graph : A Randomization Test

Determining the number of relevant dimensions in the eigen-space of a graph Laplacian matrix is a central issue in many spectral graph-mining applications. We tackle here the sub-problem of finding the “right" dimensionality of Laplacian matrices, especially those often encountered in the domains of social or biological graphs: the ones underlying large, sparse, unoriented and unweighted graphs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Turkish Journal of Electrical Engineering and Computer Sciences

سال: 2022

ISSN: ['1300-0632', '1303-6203']

DOI: https://doi.org/10.55730/1300-0632.3852